A Sufficient Condition for Backtrack-Free Search
نویسندگان
چکیده
منابع مشابه
A Revised Su cient Condition for Backtrack-Free Search
In this paper, we deene the notion of !-consistency and !-graph associated with general n-ary constraint satisfaction problems and present an alternative suu-cient condition for backtrack-free search; that is, if the hypergraph associated with a general CSP has a tree-structured !-graph, then enforcing !-consistency enables the CSP to be solved by search without backtracking. We then show that ...
متن کاملBacktrack-Free Search for Resource Allocation Problems
Freuder 9] has previously given conditions that guarantee backtrack-free search when solving binary constraint networks. Freuder's condition relies on the \width" of the constraint network. Computing the width of a constraint network involves minimizing over all possible orderings of the vertices in the network. This paper presents an similar result for backtrack-free search when solving resour...
متن کاملA Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملBacktrack-Free Search for Real-Time Constraint Satisfaction
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially useful in a real-time process control or online interactive context. The conventional machinery for ensuring backtrack-free search, however, adds additional constraints, which may require an impractical amount of space. A...
متن کاملA Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing
An important open problem in wormhole routing has been to find a necessary and sufficient condition for deadlock-free adaptive routing. Recently, Duato has solved this problem for a restricted class of adaptive routing algorithms. In this paper, a necessary and sufficient condition is proposed that can be used for any adaptive or nonadaptive routing algorithm for wormhole routing, as long as on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1982
ISSN: 0004-5411,1557-735X
DOI: 10.1145/322290.322292